Dynamic Local Search
نویسنده
چکیده
A novel technique for empirical optimisation is presented, called Dynamic Local Search Algorithm (DLS). The search algorithm starts exploring the solution space only along one of its dimensions at any one time. This is done by perturbing this variable randomly along opposite directions of that dimension, creating two more variables. The magnitude of the perturbation is designed to explore local and global areas. If these perturbations were found to be minimising (or maximising) the function, then the original variable is moved toward them in a gradual manner. This gradual move will prevent the system from getting trapped in local minima. Repeated operations of the above process will gradually guide the system towards the global minimum of the function. The results arising from the application of DLS to the De Jong’s test functions compare positively with those from other global and local methods.
منابع مشابه
A Framework for Adapting Population-Based and Heuristic Algorithms for Dynamic Optimization Problems
In this paper, a general framework was presented to boost heuristic optimization algorithms based on swarm intelligence from static to dynamic environments. Regarding the problems of dynamic optimization as opposed to static environments, evaluation function or constraints change in the time and hence place of optimization. The subject matter of the framework is based on the variability of the ...
متن کاملDevelopment of an Efficient Hybrid Method for Motif Discovery in DNA Sequences
This work presents a hybrid method for motif discovery in DNA sequences. The proposed method called SPSO-Lk, borrows the concept of Chebyshev polynomials and uses the stochastic local search to improve the performance of the basic PSO algorithm as a motif finder. The Chebyshev polynomial concept encourages us to use a linear combination of previously discovered velocities beyond that proposed b...
متن کاملOptimization in Uncertain and Complex Dynamic Environments with Evolutionary Methods
In the real world, many of the optimization issues are dynamic, uncertain, and complex in which the objective function or constraints can be changed over time. Consequently, the optimum of these issues is changed nonlinearly. Therefore, the optimization algorithms not only should search the global optimum value in the space but also should follow the path of optimal change in dynamic environmen...
متن کاملMathematical Programming Models for Solving Unequal-Sized Facilities Layout Problems - a Generic Search Method
This paper present unequal-sized facilities layout solutions generated by a genetic search program named LADEGA (Layout Design using a Genetic Algorithm). The generalized quadratic assignment problem requiring pre-determined distance and material flow matrices as the input data and the continuous plane model employing a dynamic distance measure and a material flow matrix are discussed. Computa...
متن کاملAn improved memetic algorithm to minimize earliness–tardiness on a single batch processing machine
In this research, a single batch processing machine scheduling problem with minimization of total earliness and tardiness as the objective function is investigated.We first formulate the problem as a mixed integer linear programming model. Since the research problem is shown to be NP-hard, an improved memetic algorithmis proposed to efficiently solve the problem. To further enhance the memetic ...
متن کاملAn iterated local search algorithm for the time-dependent vehicle routing problem with time windows
We generalize the standard vehicle routing problem with time windows by allowing both traveling times and traveling costs to be time-dependent functions. In our algorithm, we use a local search to determine routes of the vehicles. When we evaluate a neighborhood solution, we must compute an optimal time schedule of each route. We show that this subproblem can be efficiently solved by dynamic pr...
متن کامل